Equal Superposition Transformations and Quantum Random Walks
نویسنده
چکیده
The largest ensemble of qubits which satisfy the general transformation of equal superposition is obtained by different methods, namely, linearity, no-superluminal signalling and non-increase of entanglement under LOCC. We also consider the associated quantum random walk and show that all unitary balanced coins give the same asymmetric spatial probability distribution. It is further illustrated that unbalanced coins, upon appropriate superposition, lead to new unbiased walks which have no classical analogues.
منابع مشابه
Alternation in Quantum Programming: From Superposition of Data to Superposition of Programs
We extract a novel quantum programming paradigm superposition of programs from the design idea of a popular class of quantum algorithms, namely quantum walkbased algorithms. The generality of this paradigm is guaranteed by the universality of quantum walks as a computational model. A new quantum programming language QGCL is then proposed to support the paradigm of superposition of programs. Thi...
متن کاملSlow transport by continuous time quantum walks.
Continuous time quantum walks (CTQWs) do not necessarily perform better than their classical counterparts, the continuous time random walks (CTRWs). For one special graph, where a recent analysis showed that in a particular direction of propagation the penetration of the graph is faster by CTQWs than by CTRWs, we demonstrate that in another direction of propagation the opposite is true. In this...
متن کاملWigner formula of rotation matrices and quantum walks
Quantization of a random-walk model is performed by giving a multi-component qubit to a walker at site and by introducing a quantum coin, which is represented by a unitary matrix. In quantum walks, the qubit of walker is mixed according to the quantum coin at each time step, when the walker hops to other sites. The standard (discrete) quantum-walk model in one-dimension is defined by using a 2×...
متن کاملContinuous Time Quantum Walks (CTQW)
Quantum computing became a prominent area of research with publications such as Feynman’s 1986 paper suggesting a construction for a Hamiltonian that can implement any quantum circuit [1]. Some of the key results in quantum information science such as Shor’s algorithm [2] and Grover’s algorithm [3] which show speed up over classical algorithms for integer factorisation and database searching ha...
متن کاملTwo examples of discrete-time quantum walks taking continuous steps
This note introduces some examples of quantum random walks in R and proves the weak convergence of their rescaled n-step densities. One of the examples is called the Plancherel quantum walk because the “quantum coin flip” is the Fourier Integral (or Plancherel) Transform. The other examples are the Birkhoff quantum walks, so named because the coin flips are effected by means of measure preservi...
متن کامل